Hamilton paths in tournaments and a problem of McMullen on projective transformations in RdLAS VERGNAS, M.Bulletin of the London Mathematical Society. 1986, Num 75, pp 571-572, issn 0024-6093Article

The hamiltonicity of bipartite graphs involving neighborhood unionsGUANTAO CHEN; SAITO, Akira; BING WEI et al.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 45-56, issn 0012-365XConference Paper

On minimum degree in hamiltonian path graphsHENDRY, G. R. T.Journal of graph theory. 1988, Vol 12, Num 4, pp 491-497, issn 0364-9024Article

Stable set meeting every longest pathHAVET, F.Discrete mathematics. 2004, Vol 289, Num 1-3, pp 169-173, issn 0012-365X, 5 p.Article

P systems with gemmation of mobile membranesBESOZZI, Daniela; ZANDRON, Claudio; MAURI, Giancarlo et al.Lecture notes in computer science. 2001, pp 136-153, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Generating linear extensions by adjacent transpositionsWEST, D. B.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 1, pp 58-64, issn 0095-8956Article

The branching graphs of polyhexes: some elementary theorems, conjectures and open questionsKIRBY, E. C; GUTMAN, I.Journal of mathematical chemistry. 1993, Vol 13, Num 3-4, pp 359-374, issn 0259-9791Article

On rotations and the generation of binary treesLUCAS, J. M; ROELANTS VAN BARONAIGIEN, D; RUSKEY, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 343-366, issn 0196-6774Article

Hamiltonian decomposition of K_n^*, patterns with distinct differences, and Tuscan squaresETZION, T.Discrete mathematics. 1991, Vol 91, Num 3, pp 259-276, issn 0012-365XArticle

An algorithm for finding Hamilton paths and cycles in random graphsBOLLOBAS, B; FENNER, T. I; FRIEZE, A. M et al.Combinatorica (Print). 1987, Vol 7, Num 4, pp 327-341, issn 0209-9683Article

Fault-free pairwise independent hamiltonian paths on faulty hypercubesHSIEH, Sun-Yuan.Lecture notes in computer science. 2006, pp 373-379, issn 0302-9743, isbn 3-540-40056-7, 1Vol, 7 p.Conference Paper

A linear-time algorithm for finding Hamiltonian cycles in tournamentsMANOUSSAKIS, Y.Discrete applied mathematics. 1992, Vol 36, Num 2, pp 199-201, issn 0166-218XArticle

Hamiltonian properties of grid graphsZAMFIRESCU, C; ZAMFIRESCU, T.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 564-570, issn 0895-4801Article

Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groupsJUNGREIS, D.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 95-104, issn 0012-365X, 10 p.Article

Efficient algorithms for the longest path problemUEHARA, Ryuhei; UNO, Yushi.Lecture notes in computer science. 2004, pp 871-883, issn 0302-9743, isbn 3-540-24131-0, 13 p.Conference Paper

The Hamiltonicity of directed σ-τ Cayley graphs (Or: a tale of backtracking)RUSKEY, F; MING JIANG; WESTON, A et al.Discrete applied mathematics. 1995, Vol 57, Num 1, pp 75-83, issn 0166-218XArticle

Hamiltonian paths and Hamiltonian connectivity in graphsBING WEI.Discrete mathematics. 1993, Vol 121, Num 1-3, pp 223-228, issn 0012-365XConference Paper

Factorizations of regular graphsCUAN-QUAN ZHANG; YONG-JIN ZHU.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 1, pp 74-89, issn 0095-8956Article

On a problem of HendryHART, M. R; XINGXING YU.Discrete mathematics. 1992, Vol 102, Num 1, pp 107-108, issn 0012-365XArticle

Finding a Hamilton path through a family on intervalsSRIDHAR, M. A; GOYAL, S.International journal of computer mathematics. 1994, Vol 51, Num 3-4, pp 133-140, issn 0020-7160Article

Minimal hyper-Hamilton laceable graphsLEWINTER, M; WIDULSKI, W.Mathematical and computer modelling. 1993, Vol 17, Num 11, pp 125-127, issn 0895-7177Article

On the Hamiltonian path graph of a graphHENDRY, G. R. T.Journal of graph theory. 1987, Vol 11, Num 3, pp 373-384, issn 0364-9024Article

The Hyper-Panconnectedness of the Crossed CubeCHEN, Hon-Chan; KUNG, Tzu-Liang; HSU, Lih-Hsing et al.Parallel and distributed processing techniques and applications. International conferenceWorldComp'2011. 2011, pp 123-127, isbn 1-60132-193-7 1-60132-194-5 1-60132-195-3, 5 p.Conference Paper

A light-based device for solving the hamiltonian path problemOLTEAN, Mihai.Lecture notes in computer science. 2006, pp 217-227, issn 0302-9743, isbn 3-540-38593-2, 1Vol, 11 p.Conference Paper

Page / 13